The Anonymous Consensus Hierarchy and Naming Problems
نویسنده
چکیده
This paper investigates whether the assumption of unique identifiers is essential for wait-free distributed computing using shared objects of various types. Algorithms where all processes are programmed identically and do not use unique identifiers are called anonymous. A variety of results are given about the anonymous solvability of two key problems, consensus and naming, in systems of various sizes. These problems are used to define measures of a type T ’s power to solve problems anonymously. These measures provide a significant amount of information about whether anonymous implementations of one type from another are possible. We compare these measures with one other and with the consensus numbers defined by Herlihy [14].
منابع مشابه
Solving CSPs with Naming Games
Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the naming games. The naming game was introduced to represent N agents that have to bootstrap an agreement on a name to give to an object. The agents do not have a hierarchy and use a minimal protocol. Still they converge to a consist...
متن کاملNaming Game on Networks: Let Everyone be Both Speaker and Hearer
To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios....
متن کاملPicture Naming in Children With and Without Specific Language Impairment: An Error Analysis Study
Objectives: The lexical-level deficits are one of the hallmark limitations observed in early school-age children with specific language impairment. These problems are the predictors of reading problems and poor performance at school. Most studies in Persian-speaker children with specific language impairment have focused on syntax and morphology and the naming errors profile of these children ar...
متن کاملObstruction - free Snapshot , Obstruction - free Consensus , and Fetch - and - add Modulo k Jack Bowman Advisor : Prasad Jayanti
In this thesis we design algorithms for three problems: snapshot, consensus, and fetch-and-add modulo k. Our solutions for snapshot and consensus are non-anonymous and obstruction-free, and our solution for Fetch-and-add Modulo k is wait-free. We also conjecture an anonymous, obstruction-free solution to consensus.
متن کاملComparing Verb and Object Naming Between Patients With Parkinson Disease and Patients With Cortical Stroke
Objectives: Based on recent studies, verb naming is more impaired than noun naming in patients with Parkinson Disease (PD). Noun and verb retrieval problems has been well documented in patients with cortical damage. To explore the possible contribution of cortex and subcortex areas in word finding test performance, we studied verb and object naming in patients with cortical and subcortical lesi...
متن کامل